Computing Maximal Bisimulations
نویسندگان
چکیده
We present and compare several algorithms for computing the maximal strong bisimulation, the maximal divergence-respecting delay bisimulation, and the maximal divergence-respecting weak bisimulation of a generalised labelled transition system. These bisimulation relations preserve CSP semantics, as well as the operational semantics of programs in other languages with operational semantics described by such GLTSs and relying only on observational equivalence. They can therefore be used to combat the space explosion problem faced in explicit model checking for such languages.
منابع مشابه
Sound Bisimulations for Higher-Order Distributed Process Calculus
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...
متن کاملBarbed Bisimulations for Timed Distributed π-calculus
Modelling distributed systems requires notions as locations, communication among the distributed processes, and resource access. To express time constraints for such systems, we have introduced timed distributed π-calculus called tDπ as an extension of the π-calculus with locations, types and timers. Timers define both timeouts for communication channels and timeouts for resources. We define th...
متن کاملBisimulations for Communicating Transactions
We develop a theory of bisimulations for a simple language containing communicating transactions, obtained by dropping the isolation requirement of standard transactions. Such constructs have emerged as a useful programming abstraction for distributed systems. In systems with communicating transactions actions are tentative, waiting for certain transactions to commit before they become permanen...
متن کاملUpper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
In this paper we study Pfaffian hybrid systems which were first introduced in [9]. Pfaffian hybrid systems are a sub-class of o-minimal hybrid systems which capture rich continuous dynamics and yet can be studied using finite bisimulations. The existence of finite bisimulations for ominimal hybrid systems has been shown by several authors (see e.g. [2, 3, 11]). The next natural question to inve...
متن کاملUpper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be studied using finite bisimulations. The existence of finite bisimulations for o-minimal dynamical and hybrid systems has been shown by several authors (see e.g. [2, 3, 11]). The next natural question to investigate i...
متن کامل